Groups defined by permutations of a single word
نویسندگان
چکیده
منابع مشابه
Groups defined by automata
Finite automata have been used effectively in recent years to define infinite groups. The twomain lines of research have as their most representative objects the class of automatic groups (in-cluding word-hyperbolic groups as a particular case) and automata groups (singled out among themore general self-similar groups).The first approach implements in the language of automat...
متن کاملSylow Groups of Groups of Polynomial Permutations
We enumerate and describe the Sylow p-groups of the group of polynomial permutations of the integers mod p . MSC 2000: primary 20D20, secondary 11T06, 13M10, 11C08, 13F20, 20E18.
متن کاملPermutations over cyclic groups
Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements a1, . . . , am of the cyclic group of order m, there is a permutation π such that 1a π(1) + · · ·+maπ(m) = 0.
متن کاملInfinite ternary square-free words concatenated from permutations of a single word
We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n ≥ 13. We show that there are uniform ternary morphisms of length k for every k ≥ 23. This resolves almost completely a problem of the author and Rampersad.
متن کاملOn Generating Permutations Under User-Defined Constraints
In this paper, a method to generate permutations of a string under a set of constraints decided by the user is presented. The required permutations are generated without generating all the permutations. Keywords— Permutations; Algorithm; Matrices; Constraints; Determinants Full Text: http://www.ijcsmc.com/docs/papers/February2014/V3I2201414.pdf
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1969
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1969-0240176-5